Optimal register sharing for high-level synthesis of SSA form programs
نویسندگان
چکیده
منابع مشابه
Interconnect Optimization for High-Level Synthesis of SSA-Form Programs
Register Allocation for Programs in Static Single Assignment (SSA) Form has a Polynomial-Time Solution because interference graphs for procedures in this representation are chordal graphs. This paper explores a complementary problem which is NPComplete: the assignment of registers to variables in order to minimize interconnect costs. In particular, we attempt to minimize the size of the multipl...
متن کاملOptimal Polynomial-Time Interprocedural Register Allocation for High-Level Synthesis Using SSA Form
An optimal, polynomial-time algorithm for interprocedural register allocation in high-level synthesis and ASIP design is presented. The algorithm determines the minimum number of registers required to store all scalar variables in an application without spilling any to memory. Although an optimal polynomialtime algorithm has been presented in the past for individual procedures in Static Single ...
متن کاملOptimal register allocation for SSA-form programs in polynomial time
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All rights reserved.
متن کاملRegister allocation for programs in SSA form
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation architecture for programs in SSA-form which simplifies register allocation significantly. We investigate certain properties of SSA-programs and their interference graphs, showing that they belong to the class of chor...
متن کاملTowards Register Allocation for Programs in SSA-form
In this technical report, we present an architecture for register allocation on the SSA-form. We show, how the properties of SSA-form programs and their interference graphs can be exploited to develop new methods for spilling, coloring and coalescing. We present heuristic and optimal solution methods for these three subtasks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2006
ISSN: 0278-0070
DOI: 10.1109/tcad.2006.870409